#include <bits/stdc++.h>
using namespace std;

const int N = 1e4 + 10;

class Solution {
private:    
    int d[N];
    int st[N];
    vector<vector<int>> v[N];
    vector<int> ans;
public:
    void dfs(int u, int c) {
        
        for (int i = 0; i < )
        
    }
    vector<int> gardenNoAdj(int n, vector<vector<int>>& paths) {
        ans.resize(n, -1);
        for (int i = 0; i < paths.size(); i++) {
            int x = paths[i][0], y = paths[i][1];
            v[x].push_back(y);
            
           v[x].push_back(y), v[y].push_back(x);
        }
        for (int i = 1; i <= n; i++) {
            if (ans[i] != -1)   continue;
            dfs(i, 1);   
        }
    }
};